Termination and non-termination specification inference

Non-Termination Inference and Optimal Termination Conditions of Logic Program

Non-Termination Inference for Optimal Termination Conditions of Logic Programs

In this paper, we present an approach to non-termination inference of logic programs. Our framework relies on an extension of the Lifting Theorem, where some specific argument positions can be instantiated while others are generalized. Atomic left looping queries are then generated bottom-up from selected subsets of the binary unfoldings of the program of interest. Then non-termination inferenc...

Non-termination Inference for Constraint Logic Programs

Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given class of queries, i.e. finiteness of all the possible derivations produced by a Prolog engine from any query in that class. In contrast, the study of the dual problem: nontermination w.r.t. the left selection rule i....

Inference of termination conditions

Numerical computations form an essential part of almost any real-world program. Clearly, in order for a termination analyser to be of practical use it should contain a mechanism for inferring termination of such computations. However, this topic attracted less attention of the research community. In works of Der-showitz et al. 5] and Ruggieri 9] such termination analysis techniques were present...

A Termination Detection Algorithm: Specification and Verification

We propose a methodology for the specification and verification of distributed algorithms using Gurevich’s concept of Abstract State Machines. The methodology relies on a distinction between a higherlevel specification and a lower-level specification of an algorithm. The algorithm is characterized by an informal problem description. A justification assures the appropriateness of the higher-leve...